Modeling of temporal dependence in packet loss using universal modeling concepts

Packet losses are commonplace over the Internet, and can severely affect the quality of delay sensitive multimedia applications. In the current Internet architecture it is up to the application to react to the perceived congestion level in the network. The ability of the application to react is enhanced by the availability of simple and efficient loss models. Traditionally, Markov chain models have been proposed for modeling of the dependency in packet loss. In this abstract we establish the drawbacks of using a Markov chain model and instead propose the more general Markov tree model for modeling the temporal dependency. Markov tree models are an example of universal models. In universal modeling, the most appropriate model for the observed data is chosen from a collection of models. Entropy of the data with respect to a model is used as the performance measure so that the model which gives the lowest entropy for the data is chosen as the best model. Our results show the advantage of using the Markov tree model. The first author is with the IBM India Research Lab., New Delhi, India. The second author is with the Integrated Media Systems Center and the Dept. of Electrical Engineering at University of Southern California. [[email protected],[email protected]]. This work was done by the first author as part of his PhD. thesis when he was at IMSC. This research has been funded in part by the Integrated Media Systems Center, a National Science Foundation Engineering Research Center, Cooperative Agreement No. EEC-9529152 and by the National Science Foundation under grant MIP-9804959. December 25, 2001 DRAFT SUBMITTED TO IEEE PACKET VIDEO WORKSHOP 2002 2